Tunneling Catastrophes of the Partition Function

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tunneling Catastrophes of the Partition Function

We use path-integrals to derive a general expression for the semiclassical approximation to the partition function of a one-dimensional quantummechanical system. Our expression depends solely on ordinary integrals which involve the potential. For high temperatures, the semiclassical expression is dominated by single closed paths. As we lower the temperature, new closed paths may appear, includi...

متن کامل

The Dimer Partition Function

We apply the Ginzburg criterion to the dimer problem and we solve the apparent contradiction of a system with mean field α = 12 , the typical value of tricritical systems, and upper critical dimension Dcr = 6. We find that the system has upper critical dimensionDcr = 6 , while for D ≤ 4 it should undergo a first order phase transition. We comment on the latter wrong result examining the approxi...

متن کامل

The Partition Function Revisited

In 1918, Hardy and Ramanujan wrote their landmark paper deriving the asymptotic formula for the partition function. The paper however was fundamental for another reason, namely for introducing the circle method in questions of additive number theory. Though this method is powerful, it is often difficult and technically complicated to employ. In 2011, Bruinier and Ono discovered a new algebraic ...

متن کامل

Congruences of the Partition Function

Ramanujan also conjectured that congruences (1) exist for the cases A = 5 , 7 , or 11 . This conjecture was proved by Watson [17] for the cases of powers of 5 and 7 and Atkin [3] for the cases of powers of 11. Since then, the problem of finding more examples of such congruences has attracted a great deal of attention. However, Ramanujan-type congruences appear to be very sparse. Prior to the la...

متن کامل

Parity of the Partition Function

Let p(n) denote the number of partitions of a non-negative integer n. A well-known conjecture asserts that every arithmetic progression contains infinitely many integers M for which p(M) is odd, as well as infinitely many integers N for which p(N) is even (see Subbarao [22]). From the works of various authors, this conjecture has been verified for every arithmetic progression with modulus t whe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Brazilian Journal of Physics

سال: 1997

ISSN: 0103-9733

DOI: 10.1590/s0103-97331997000300006